Blending of Genetic Algorithm with Fletcher Reeves Method to Solve Reactive Power Problem
نویسندگان
چکیده
منابع مشابه
A New Approach to Solve N-Queen Problem with Parallel Genetic Algorithm
Over the past few decades great efforts were made to solve uncertain hybrid optimization problems. The n-Queen problem is one of such problems that many solutions have been proposed for. The traditional methods to solve this problem are exponential in terms of runtime and are not acceptable in terms of space and memory complexity. In this study, parallel genetic algorithms are proposed to solve...
متن کاملA Modified Fletcher-Reeves-Type Method for Nonsmooth Convex Minimization
Conjugate gradient methods are efficient for smooth optimization problems, while there are rare conjugate gradient based methods for solving a possibly nondifferentiable convex minimization problem. In this paper by making full use of inherent properties of Moreau-Yosida regularization and descent property of modified conjugate gradient method we propose a modified Fletcher-Reeves-type method f...
متن کاملAn Efficient Genetic Algorithm to Solve the Intermodal Terminal Location problem
The exponential growth of the flow of goods and passengers, fragility of certain products and the need for the optimization of transport costs impose on carriers to use more and more multimodal transport. In addition, the need for intermodal transport policy has been strongly driven by environmental concerns and to benefit from the combination of different modes of transport to cope with the in...
متن کاملHybrid Intelligent Algorithm to Solve Multi Objective Reactive Power Control Problem
Reactive power and voltage control is a minimization problem. In this paper the multi objective function consist of minimization of real power losses, minimization of voltage deviation and minimization of voltage stability index subjected to equality and inequality constraints are considered. This can be achieved by proper adjustment of control variables such as the generator voltages, the tran...
متن کاملA Study of Genetic Algorithm to Solve Travelling Salesman Problem
This paper presents the literature survey review of Travelling Salesman Problem (TSP). TSP belongs to the category of NP-hard problems. A various number of methods have been designed to solve this problem. Genetic Algorithm is one of the best methods which is used to solve various NP-hard problem such as TSP. The natural evolution process is always used by genetic Algorithm to solve the problem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Balkan Journal of Electrical and Computer Engineering
سال: 2015
ISSN: 2147-284X
DOI: 10.17694/bajece.25519